Voronoi Diagrams for Parallel Halflines in 3D
نویسندگان
چکیده
We consider the Euclidean Voronoi diagram for a set of n parallel halflines in R. A relation of this diagram to planar power diagrams is shown, and is used to analyze its geometric and topological properties. Moreover, a simple plane-sweep algorithm is given that computes the Voronoi diagram for parallel halflines at logarithmic cost per face.
منابع مشابه
Approximations of 3D generalized Voronoi diagrams
We introduce a new approach to approximate generalized 3D Voronoi diagrams for different site shapes (points, spheres, segments, lines, polyhedra, etc) and different distance functions (Euclidean metrics, convex distance functions, etc). The approach is based on an octree data structure denoted Voronoi-Octree (VO) that encodes the information required to generate a polyhedral approximation of t...
متن کاملIncremental Updates of Configuration Space Representations for Non-Circular Mobile Robots with 2D 2.5D or 3D Obstacle Models
This paper presents techniques to incrementally update collision maps, distance maps, and Voronoi diagrams in the configuration space of non-circular mobile robots. Compared to previous work, our approach only updates the cells affected by changes in the environment. Thus, it is applicable in large workspaces and in the presence of unknown or moving obstacles. The c-space collision maps allow f...
متن کاملEfficient Computation of Discrete Voronoi Diagram and Homotopy-Preserving Simplified Medial Axis of a 3D Polyhedron
AVNEESH SUD: Efficient Computation of Discrete Voronoi Diagram and Homotopy-Preserving Simplified Medial Axis of a 3D Polyhedron. (Under the direction of Dinesh Manocha.) The Voronoi diagram is a fundamental geometric data structure and has been well studied in computational geometry and related areas. A Voronoi diagram defined using the Euclidean distance metric is also closely related to the ...
متن کاملK-Voronoi diagrams computing in arbitrary domains
We propose a novel algorithm to compute Voronoi diagrams of order k in arbitrary 2D and 3D domains. The algorithm is based on a fast ordered propagation distance transformation called occlusion points propagation geodesic distance transformation (OPPGDT) which is robust and linear in the domain size, and has higher accuracy than other geodesic distance transformations published before. Our appr...
متن کاملPoint Cluster Analysis Using a 3D Voronoi Diagram with Applications in Point Cloud Segmentation
Three-dimensional (3D) point analysis and visualization is one of the most effective methods of point cluster detection and segmentation in geospatial datasets. However, serious scattering and clotting characteristics interfere with the visual detection of 3D point clusters. To overcome this problem, this study proposes the use of 3D Voronoi diagrams to analyze and visualize 3D points instead o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2016